Support sizes of threefold quadruple systems
نویسندگان
چکیده
منابع مشابه
Latin and semi-Latin factorizations of complete graphs and support sizes of quadruple systems
paper) we introduce notions of Latin and semi-Latin factorizations and their support sizes. We determine the set support of Latin and factorizations of Utilizing r!{yt"'T'l'Yl1np the set QSS(8m, A) of support sizes of quadruple systems of order 8m and index A for m 6 with at most 5 OITllSSlOIlS for each m 0 Introd uction Let be a finite set and be a We denote by the set of all k-subsets of i:)U...
متن کاملAffine - invariant quadruple systems
Let t, v, k, λ be positive integers satisfying v > k > t. A t-(v, k, λ) design is an ordered pair (V,B), where V is a finite set of v points, B is a collection of k-subsets of V , say blocks, such that every t-subset of V occurs in exactly λ blocks in B. In what follows we simply write t-designs. A 3-(v, 4, 1) design is called a Steiner quadruple system and denoted by SQS(v). It is known that a...
متن کاملOn Quadruple Systems
( n — h\ 11 m — h\ I-hi I \l-hj is the number of those elements of S (I, m, n) which contain h fixed elements of E. It is known that condition (1) is not sufficient for S(l, m, n) to exist. It has been proved that no finite projective geometry exists with 7 points on every line. This implies non-existence of 5(2, 7, 43). There arises a problem of finding a necessary and sufficient condition for...
متن کاملQuadruple systems with independent neighborhoods
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max α { α ( n− α 3 ) + (n− α) ( α 3 )} = ( 1 2 + o(1) )( n 4 ) denote the maximum number of edges in an n-vertex odd 4-graph. Let n be sufficiently large, and let G be an n-vertex 4-graph such that for every triple xyz of vertices, the neighborhood ...
متن کاملCounting substructures III: quadruple systems
For various quadruple systems F , we give asymptotically sharp lower bounds on the number of copies of F in a quadruple system with a prescribed number of vertices and edges. Our results extend those of Füredi, Keevash, Pikhurko, Simonovits and Sudakov who proved under the same conditions that there is one copy of F . Our proofs use the hypergraph removal Lemma and stability results for the cor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2011
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.02.006